package com.algorithm.prim;

import com.sun.org.apache.xml.internal.security.keys.content.MgmtData;
import com.xxy.graph.Graph;

import java.util.Arrays;

/**
 * @author xxy
 * @create 2021 3 26 9:50
 */
public class Prim {
    public static void main(String[] args) {
        char[] data={'A','B','C','D','E','F','G'};
        int verxs=data.length;
        int[][] weight=new int[][]{
                {10000,5,7,10000,10000,10000,2},
                {5,10000,10000,9,10000,10000,3},
                {7,10000,10000,10000,8,10000,10000},
                {10000,9,10000,10000,10000,4,10000},
                {10000,10000,8,10000,10000,5,4},
                {10000,10000,10000,4,5,10000,6},
                {2,3,10000,10000,4,6,10000}
        };
        MGraph graph = new MGraph(verxs);
        MinTree minTree = new MinTree();
        minTree.creatGraph(graph, verxs, data, weight);
        minTree.showGraph(graph);
        minTree.prim(graph,1);
    }
}
class MinTree{
    public void creatGraph(MGraph graph, int verxs, char[] data, int[][] weight) {
        int i,j;
        for (i = 0; i < verxs; i++) {
            graph.data[i] = data[i];
            for (j = 0; j < verxs; j++) {
                graph.weight[i][j]=weight[i][j];
            }
        }
    }
    public void showGraph(MGraph graph){
        for(int[] link:graph.weight){
            System.out.println(Arrays.toString(link));
        }
    }
    public void prim(MGraph graph,int v){
        int[] visited = new int[graph.verxs];
        visited[v]=1;
        int h1=-1;
        int h2=-1;
        int minWeight=10000;
        for (int k = 1; k < graph.verxs; k++) {
            for (int i = 0; i < graph.verxs; i++) {
                    for (int j = 0; j < graph.verxs; j++) {
                        if(visited[i]==1 && visited[j]==0 &&graph.weight[i][j]<minWeight){
                            minWeight=graph.weight[i][j];
                            h1=i;
                            h2=j;
                        }
                    }
            }
            System.out.println("边<"+graph.data[h1]+","+graph.data[h2]+"> 权值"+minWeight);
            visited[h2]=1;
            minWeight=10000;
            }

    }
}
class MGraph{
    int verxs;//节点数
    char[] data;//存放节点
    int[][] weight;//存放边，邻接矩阵

    public MGraph(int verxs) {
        this.verxs=verxs;
        data =new char[verxs];
        weight=new int[verxs][verxs];
    }
}
